FORCE: A Fast & Easy-to-Implement Variable-Ordering Heuristic
نویسندگان
چکیده
The MINCE heuristic for variable-ordering [1] can successfully reduce the size of BDDs and accelerate SAT-solving. Applications to reachability analysis have also been successful [12]. The main drawback of MINCE is its implementation complexity the authors used a pre-existing min-cut placer [6] that is several times larger than any existing SAT solver. Tweaking MINCE is difficult. In this work we propose a replacement heuristic, FORCE which is easy to implement from scratch and tweak. It is dramatically faster than MINCE in practice. While FORCE may produce seemingly inferior variable orderings, the difference with MINCE orderings does not affect subsequent SAT-solving.
منابع مشابه
Learned Value-Ordering Heuristics for Constraint Satisfaction
In global search for a solution to a constraint satisfaction problem, a value-ordering heuristic predicts which values are most likely to be part of a solution. When such a heuristic uses look-ahead, it often incurs a substantial computational cost. We propose an alternative approach, survivors-first, that gives rise to a family of dynamic valueordering heuristics that are generic, adaptive, in...
متن کاملResource Constrained Project Scheduling with Material Ordering: Two Hybridized Meta-Heuristic Approaches (TECHNICAL NOTE)
Resource constrained project scheduling problem (RCPSP) is mainly investigated with the objective of either minimizing project makespan or maximizing project net present value. However, when material planning plays a key role in a project, the existing models cannot help determining material ordering plans to minimize material costs. In this paper, the RCPSP incorporated with the material order...
متن کاملAn Ant Approach for Structured Quadratic Assignment Problems
The paper presents a new heuristic method for the quadratic assignment problem. This method is based on an artificial ant system, hybridized with a fast local search. The method is easy to implement and numerical results show that it is fast and efficient for structured problems.
متن کاملPushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size two parameters known to bound the complexity of inference in graphical models. We propose and implement the Iterative Greedy Variable Ordering (IGVO) algorithm, a new variant within this algorithm class. An empirical evaluation using different ranking functions an...
متن کاملApplying Machine Learning to the Problem of Choosing a Heuristic to Select the Variable Ordering for Cylindrical Algebraic Decomposition
Cylindrical algebraic decomposition(CAD) is a key tool in computational algebraic geometry, particularly for quantifier elimination over real-closed fields. When using CAD, there is often a choice for the ordering placed on the variables. This can be important, with some problems infeasible with one variable ordering but easy with another. Machine learning is the process of fitting a computer m...
متن کامل